A characterization of locally finite vertex-transitive graphs
نویسندگان
چکیده
منابع مشابه
All vertex-transitive locally-quasiprimitive graphs
The polycirculant conjecture states that every transitive 2-closed permutation group of degree at least two contains a nonidentity semiregular element, that is, a nontrivial permutation whose cycles all have the same length. This would imply that every vertex-transitive digraph with at least two vertices has a nonidentity semiregular automorphism. In this paper we make substantial progress on t...
متن کاملFinite Transitive Permutation Groups and Finite Vertex-Transitive Graphs
The theory of vertex-transitive graphs has developed in parallel with the theory of transitive permutation groups. In this chapter we explore some of the ways the two theories have influenced each other. On the one hand each finite transitive permutation group corresponds to several vertex-transitive graphs, namely the generalised orbital graphs which we shall discuss below. On the other hand, ...
متن کاملAll vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism
The polycirculant conjecture states that every transitive 2-closed permutation group of degree at least two contains a nonidentity semiregular element, that is, a nontrivial permutation whose cycles all have the same length. This would imply that every vertex-transitive digraph with at least two vertices has a nonidentity semiregular automorphism. In this paper we make substantial progress on t...
متن کاملANALYSING FINITE LOCALLY s-ARC TRANSITIVE GRAPHS
We present a new approach to analysing finite graphs which admit a vertex intransitive group of automorphisms G and are either locally (G, s)– arc transitive for s ≥ 2 or G–locally primitive. Such graphs are bipartite with the two parts of the bipartition being the orbits of G. Given a normal subgroup N which is intransitive on both parts of the bipartition, we show that taking quotients with r...
متن کاملFinite vertex-primitive and vertex-biprimitive 2-path-transitive graphs
This paper presents a classification of vertex-primitive and vertex-biprimitive 2-path-transitive graphs which are not 2-arc-transitive. The classification leads to constructions of new examples of half-arc-transitive graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1987
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90033-5